package day12;

/**
 * @author oldliu
 * @since 1.0
 */
public class Digui {
    public static void a(){
        System.out.println("This is a");
        a();
    }
    //阶乘！
    // n!=1*2*3..n
    public static long jiechen(int k){
        if(k<=1)
            return 1;
        return k*jiechen(k-1);
    }
    //求斐波拉契数列的第k项
    public static long fb(int k){
        if(k<=2)
            return 1;
        return fb(k-1)+fb(k-2);
    }
    public static void prt(int k){
        if(k>1)
            prt(k-1);

        System.out.println(k);
    }
    public static void main(String[] args) {
        //a();
        prt(100);
    }
}
